The Undecidability of Second Order Multiplicative Linear Logic
نویسندگان
چکیده
The multiplicative fragment of second order propositional linear logic is shown to be undecidable.
منابع مشابه
Simulating Computations in Second Order Non-Commutative Linear Logic
Lincoln, Scedrov and Shankar proved undecidability of intuitionistic second order multiplicative commutative linear logic by embedding LJ2 into this logic. Emms did the same for intuitionistic second order non-commutative linear logic. Recently, Lafont and Scedrov demonstrated undecidability of classical second order multiplicative commutative linear logic. As for classical second order non-com...
متن کاملThe Undecidability of Second Order Linear Logic Without Exponentials
Recently, Lincoln, Scedrov and Shankar showed that the multi-plicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-addit...
متن کاملOn the Expressivity of Two Refinements of Multiplicative Exponential Linear Logic
The decidability of multiplicative exponential linear logic (MELL) is currently open. I show that two independently interesting refinements of MELL that alter only the syntax of proofs—leaving the underlying truth untouched— are undecidable. The first refinement uses new modal connectives between the linear and the unrestricted judgments, and the second is based on focusing with priority assign...
متن کاملUndecidability of Multiplicative Subexponential Logic
Subexponential logic is a variant of linear logic with a family of exponential connectives—called subexponentials—that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction. We show that classical propositional multiplicative linear logic extended with one unrestricted and two incomparable linear subexponentials c...
متن کاملA Undecidability of propositional separation logic and its neighbours
In this paper, we investigate the logical structure of memory models of theoretical and practical interest. Separation logic provides us with an effective language for reasoning about such memory models. Our main result is that for any concrete choice of heap-like memory model, validity in that model is undecidable even for purely propositional formulas in this language. The main novelty of our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 125 شماره
صفحات -
تاریخ انتشار 1996